Optimal strategies for equal-sum dice games
نویسندگان
چکیده
منابع مشابه
Optimal strategies for equal-sum dice games
In this paper we consider a non-cooperative two-person zero-sum matrix game, called dice game. In an (n, σ) dice game, two players can independently choose a dice from a collection of hypothetical dice having n faces and with a total of σ eyes distributed over these faces. They independently roll their dice and the player showing the highest number of eyes wins (in case of a tie, none of the pl...
متن کاملThe Distribution of Optimal Strategies in Symmetric Zero-sum Games
Given a skew-symmetric matrix, the corresponding two-player symmetric zero-sum game is defined as follows: one player, the row player, chooses a row and the other player, the column player, chooses a column. The payoff of the row player is given by the corresponding matrix entry, the column player receives the negative of the row player. A randomized strategy is optimal if it guarantees an expe...
متن کاملNontransitive Dice With Equal Means∗
We analyze a game in which two players choose in turn and roll an n-sided die, each player having his choice of numbering of the faces, subject to certain constraints. The player who rolls the larger number wins. We say die B “dominates” die A if P [B > A] > P [A > B]. The nontransitivity of this dominance relation for dice has been studied by several authors. We analyze the case of n-sided dic...
متن کاملAlgorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information
In stochastic games with perfect information, in each state at most one player has more than one action available. We propose two algorithms which find the uniform optimal strategies for zero-sum two-player stochastic games with perfect information. Such strategies are optimal for the long term average criterion as well. We prove the convergence for one algorithm, which presents a higher comple...
متن کاملFinding Optimal Strategies for Imperfect Information Games
Ian Frank Complex Games Lab Electrotechnical Laboratory Umezono 1-1-4, Tsukuba Ibaraki, JAPAN 305 [email protected] David Basin Institut f ur Informatik Universitat Freiburg Am Flughafen 17 Freiburg, Germany [email protected] Hitoshi Matsubara Complex Games Lab Electrotechnical Laboratory Umezono 1-1-4, Tsukuba Ibaraki, JAPAN 305 [email protected] Abstract We examine three heuris...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2006
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.04.024